A 2-COLORING OF [1, n] CAN HAVE n²/2a(a2+2a+3) + O(n) MONOCHROMATIC TRIPLES OF THE FORM . . .

نویسنده

  • THOTSAPORN “AEK” THANATIPANONDA
چکیده

We solve a problem posed by Ronald Graham about the minimum number, over all 2-colorings of [1, n], of monochromatic (x, y, x + ay) triples, a ≥ 2. We show that the minimum number of such triples is n 2 2a(a+2a+3) + O(n). We also find a new upper bound for the minimum number, over all r-colorings of [1, n], of monochromatic Schur triples, for r ≥ 3.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Monochromatic Schur Triples Type Problem

We discuss a problem posed by Ronald Graham about the minimum number, over all 2-colorings of [1, n], of monochromatic {x, y, x + ay} triples for a ≥ 1. We give a new proof of the original case of a = 1. We show that the minimum number of such triples is at most n 2 2a(a2+2a+3) + O(n) when a ≥ 2. We also find a new upper bound for the minimum number, over all r-colorings of [1, n], of monochrom...

متن کامل

On generalized van der Waerden triples

Van der Waerden’s classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k, r), such that any rcoloring of {1, 2, . . . , w(k, r)} must contain a monochromatic k-term arithmetic progression {x, x+d, x+2d, . . . , x+(k−1)d}. We investigate the following generalization of w(3, r). For fixed positive integers a and b wit...

متن کامل

Are monochromatic Pythagorean triples avoidable?

A Pythagorean triple is a triple of positive integers a,b,c ∈ N+ satisfying a2 + b2 = c2. Is it true that, for any finite coloring of N+, at least one Pythagorean triple must be monochromatic? In other words, is the Diophantine equation X2 +Y 2 = Z2 regular? This problem has been open since several decades, even restricted to 2-colorings. In this note, we introduce partial morphisms, which are ...

متن کامل

On the asymptotic minimum number of monochromatic 3-term arithmetic progressions

Let V (n) be the minimum number of monochromatic 3-term arithmetic progressions in any 2-coloring of {1, 2, . . . , n}. We show that 1675 32768 n(1 + o(1)) ≤ V (n) ≤ 117 2192 n(1 + o(1)). As a consequence, we find that V (n) is strictly greater than the corresponding number for Schur triples (which is 1 22 n(1 + o(1))). Additionally, we disprove the conjecture that V (n) = 1 16 n(1 + o(1)) as w...

متن کامل

Chemical Constituents from the Stem Barks of Plumeria rubra L.

Background and objectives: Plumeria rubra L. (Apocynaceae) is a deciduous shrub or small tree cultivated in subtropical and tropical countries.  Its bark is prescribed to treat amoebic dysentery,   dropsy, jaundice, scabies, gonorrhea, venereal affections and wounds. In the present research, we aimed to isolate and identify the chemical constituents of the bark of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008